complexity of computing meaning in English

计算复杂性

In 1998 , zhou , xiong and zhu improved sh algorithm by reducing this complexity to 2n - lg n . in this paper , we make further improvement . the overall complexity of computing distances is reduced to 3n - lg n 2 , which is only half that of sh algorithm
但是距离的计算量相对于其他基本代数或者逻辑操作来说开销比较大,所以如何降低整个算法过程中距离的计算次数成为我们考虑的重点，我们改进的目标就是使得计算距离的复杂度尽可能的小。
In one process of combination , the euclidean distances between 3n pairs of points need to be computed , so the overall complexity of computing distance is then 3n - lg n . since the computation of distance is more costly compared with other basic operation , how to improve sh algorithm from the aspect of complexity of computing distance is considered
对带左半部分内的每个点，算法需要考虑带右半部分内的至多6个点，假设平面上点的个数为n ,该算法在归并时最坏情况下需要求出3n对点对之间的距离，从而整个算法计算距离的复杂度为3n lg n 。